Evaluations of $k$-fold Euler/Zagier sums: a compendium of results for arbitrary $k$
نویسندگان
چکیده
منابع مشابه
Evaluations of k-fold Euler/Zagier sums: a compendium of results for arbitrary k
Euler sums (also called Zagier sums) occur within the context of knot theory and quantum field theory. There are various conjectures related to these sums whose incompletion is a sign that both the mathematics and physics communities do not yet completely understand the field. Here, we assemble results for Euler/Zagier sums (also known as multidimensional zeta/harmonic sums) of arbitrary depth,...
متن کاملn-fold Commutative Hyper K-ideals
In this paper, we aresupposed to introduce the definitions of n-fold commutative, andimplicative hyper K-ideals. These definitions are thegeneralizations of the definitions of commutative, andimplicative hyper K-ideals, respectively, which have been definedin [12]. Then we obtain some related results. In particular wedetermine the relationships between n-fold implicative hyperK-ideal and n-fol...
متن کاملSums and k-sums in abelian groups of order k
Let G be an abelian group of order k. How is the problem of minimizing the number of sums from a sequence of given length in G related to the problem of minimizing the number of k-sums? In this paper we show that the minimum number of k-sums for a sequence a1, . . . , ar that does not have 0 as a k-sum is attained at the sequence b1, . . . , br−k+1,0, . . . ,0, where b1, . . . , br−k+1 is chose...
متن کاملThe 'K' in K-fold Cross Validation
The K-fold Cross Validation (KCV) technique is one of the most used approaches by practitioners for model selection and error estimation of classifiers. The KCV consists in splitting a dataset into k subsets; then, iteratively, some of them are used to learn the model, while the others are exploited to assess its performance. However, in spite of the KCV success, only practical rule-of-thumb me...
متن کاملSUMS OF k UNIT FRACTIONS
Erdős and Straus conjectured that for any positive integer n ≥ 2 the equation 4 n = 1 x + 1 y + 1 z has a solution in positive integers x, y, and z. Let m > k ≥ 3 and Em,k(N) = | {n ≤ N | m n = 1 t1 + . . .+ 1 tk has no solution with ti ∈ N} | . We show that parametric solutions can be used to find upper bounds on Em,k(N) where the number of parameters increases exponentially with k. This enabl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 1996
ISSN: 1077-8926
DOI: 10.37236/1320